Learning Environmental Parameters for the Design of Optimal English Auctions with Discrete Bid Levels

نویسندگان

  • Alex Rogers
  • Esther David
  • Jeremy Schiff
  • Sarit Kraus
  • Nicholas R. Jennings
چکیده

In this paper we consider the optimal design of English auctions with discrete bid levels. Such auctions are widely used in online internet settings and our aim is to automate their configuration in order that they generate the maximum revenue for the auctioneer. Specifically, we address the problem of estimating the values of the parameters necessary to perform this optimal auction design by observing the bidding in previous auctions. To this end, we derive a general expression that relates the expected revenue of the auction when discrete bid levels are implemented, but the number of participating bidders is unknown. We then use this result to show that the characteristics of these optimal bid levels are highly dependent on the expected number of bidders and on their valuation distribution. Finally, we derive and demonstrate an online algorithm based on Bayesian machine learning, that allows these unknown parameters to be estimated through observations of the closing price of previous auctions. We show experimentally that this algorithm converges rapidly toward the true parameter values and, in comparison with an auction using the more commonly implemented fixed bid increment, results in an increase in auction revenue.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Mechanism Design Of Optimal English Auctions With Discrete Bid Levels

In this paper we consider the optimal design of English auctions with discrete bid levels. Such auctions are widely used in online Internet settings and our aim is to automate their configuration in order that they generate the maximum revenue for the auctioneer. Specifically, we address two complimentary problems: (i) that of determining the optimal reserve price and bid increment in these auc...

متن کامل

Optimal and Heuristic Approaches to Establishing Discrete Bid Levels in a Dutch Auction

This paper is concerned with the design of single-unit Dutch auctions. Two commonly-used heuristic approaches to setting discrete bid levels in a Dutch auction are examined. They are then compared with the optimal strategy based on a mathematical programming model to demonstrate the superiority of the latter over the former. INTRODUCTION In conducting a Dutch auction, the auctioneer starts with...

متن کامل

An Optimal Auction Infrastructure Design: An Agent-based Simulation Approach

This paper presents an agent-based simulation approach to estimate the effects of auction parameters on the auction outcomes, and to find an optimal or, at least, close to an optimal infrastructure. In particular, this study intends to study how bidders’ personalities and bidding strategies with other auction parameters affect the closing prices in two auction mechanisms: English and Yankee auc...

متن کامل

Title of dissertation : DESIGN OF

Title of dissertation: DESIGN OF DISCRETE AUCTION Pacharasut Sujarittanonta, Doctor of Philosophy, 2010 Dissertation directed by: Professor Peter Cramton Department of Economics Chapter 1: Efficient Design of an Auction with Discrete Bid Levels This paper studies one of auction design issues: the choice of bid levels. Full efficiency is generally unachievable with a discrete auction. Since ther...

متن کامل

Zero Intelligence Plus and Gjerstad-Dickhaut Agents for Sealed Bid Auctions

The increasing prevalence of auctions as a method of conducting a variety of transactions has promoted interest in modelling bidding behaviours with simulated agent models. The majority of popular research has focused on double auctions, i.e. auctions with multiple buyers and sellers. In this paper we investigate agent models of sealed bid auctions, i.e. single seller auctions where each buyer ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005